Counting Two-State Transition-Tour Sequences
نویسندگان
چکیده
This paper develops a closed-form formula, f ( k ), to count the number of transition-tour sequences of length k for bistable machines. It is shown that the function f ( k ) is related to Fibonacci numbers. Some applications of the results in this paper are in the areas of: testable sequential machine designs, random testing of register data paths, and qualification tests for random pattern generators.
منابع مشابه
Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols
In this paper, we consider the problem of test derivation based on an Extended Finite State Machine (EFSM) that is widely used for describing the behavior of telecommunication protocols and software. An EFSM augments a classical Finite State Machine (FSM) with context variables, input/output parameters and predicates. Tests based on various coverage criteria for EFSMs do not capture many functi...
متن کاملA Digital CMOS Parallel Counter Architecture
The main objective of this paper consists of the state look-ahead path and the counting path. The proposed counter is a single mode counter, which sequences through a fixed set of pre assigned count states, of which each next count state represents the next counter value in sequence. The counter is partitioned into uniform 2-bit synchronous up counting modules. Next state transitions in countin...
متن کاملTest Generation for Interaction Detection in Feature-Rich Communication Systems
This paper proposes a technique to generate test sequences to check the conformance of an implementation of a feature-rich communication system to its specification, as well as to detect the interactions between the features of the system. A concept called color span is introduced to measure the extent of the interactions between different features. A modified Chinese postman tour algorithm is ...
متن کاملOn Counting Sequences and Some Research Questions
A counting sequence is a list of all binary words of the same length. Counting sequences of any fixed odd Hamming distance between successive words (codewords) are discussed. Gray codes are examples of counting sequences having a single-bit change between neighboring codewords. We describe some results on Gray codes and highlight some research questions. The spectrum of bit changes or transitio...
متن کاملSynchronization and Specification Issues in Protocol Testing
Protocol testing for the purpose of certifying the implementation’s adherence to the protocol specification can be done with a test architecture consisting of remote tester and local responder processes generating specific input stimuli, called test sequences, and observing the output produced by the implementation under test. It is possible to adapt test sequence generation techniques for fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 45 شماره
صفحات -
تاریخ انتشار 1996